A scalable time–space multiscale domain decomposition method: adaptive time scale separation
نویسندگان
چکیده
منابع مشابه
On a mixed and multiscale domain decomposition method
This paper presents a reexamination of a multiscale computational strategy with homogenization in space and time for the resolution of highly heterogeneous structural problems, focusing on its suitability for parallel computing. Spatially, this strategy can be viewed as a mixed, multilevel domain decomposition method (or, more accurately, as a “structure decomposition” method). Regarding time, ...
متن کاملA DG Space-Time Domain Decomposition Method
In this paper we present a hybrid domain decomposition approach for the parallel solution of linear systems arising from a discontinuous Galerkin (DG) finite element approximation of initial boundary value problems. This approach allows a general decomposition of the space–time cylinder into finite elements, and is therefore applicable for adaptive refinements in space and time. 1 A Space–Time ...
متن کاملDomain decomposition method for nonlinear multiscale analysis of structures
In this presentation we consider efficient numerical strategies designed to compute the evolution of large structures undergoing localized nonlinear phenomena such as plasticity, damage, cracking or microbuckling. Despite Newton-Schur-Krylov strategies which associate both Newton type solvers and domain decomposition methods (and especially non-overlapping ones [1,2]) provide an efficient frame...
متن کاملDomain decomposition for multiscale PDEs
We consider additive Schwarz domain decomposition preconditioners for piecewise linear finite element approximations of elliptic PDEs with highly variable coefficients. In contrast to standard analyses, we do not assume that the coefficients can be resolved by a coarse mesh. This situation arises often in practice, for example in the computation of flows in heterogeneous porous media, in both t...
متن کاملA Time Scale Decomposition Approach to Adaptive ECN Marking
Fair resource allocation in high-speed networks such as the Internet can be viewed as a constrained optimization program. Kelly and his co-workers have shown that an unconstrained penalty function formulation of this problem can be used to design congestion controllers that are stable. In this paper, we examine the question of providing feedback from the network such that the congestion control...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Mechanics
سال: 2010
ISSN: 0178-7675,1432-0924
DOI: 10.1007/s00466-010-0504-2